Forgetting in Answer Set Programming – A Survey
نویسندگان
چکیده
Abstract Forgetting – or variable elimination is an operation that allows the removal, from a knowledge base, of middle variables no longer deemed relevant. In recent years, many different approaches for forgetting in Answer Set Programming have been proposed, form specific operators, classes such commonly following principles and obeying properties. Each approach was developed to address some particular view on forgetting, aimed at set properties desirable view, but comprehensive uniform overview all existing operators missing. this article, we thoroughly examine (classes of) Programming, drawing complete picture landscape these which includes novel results relations between including considerations concrete compute computational complexity. Our goal provide guidance help users choosing operator most adequate their application requirements.
منابع مشابه
Knowledge Forgetting in Answer Set Programming
The ability of discarding or hiding irrelevant information has been recognized as an important feature for knowledge based systems, including answer set programming. The notion of strong equivalence in answer set programming plays an important role for different problems as it gives rise to a substitution principle and amounts to knowledge equivalence of logic programs. In this paper, we unifor...
متن کاملSemantic forgetting in answer set programming
The notion of forgetting, also known as variable elimination, has been investigated extensively in the context of classical logic, but less so in (nonmonotonic) logic programming and nonmonotonic reasoning. The few approaches that exist are based on syntactic modifications of a program at hand. In this paper, we establish a declarative theory of forgetting for disjunctive logic programs under a...
متن کاملOn Forgetting Postulates in Answer Set Programming
Forgetting is an important mechanism for logicbased agent systems. A recent interest has been in the desirable properties of forgetting in answer set programming (ASP) and their impact on the design of forgetting operators. It is known that some subsets of these properties are incompatible, i.e., they cannot be satisfied at the same time. In this paper, we are interested in the question on the ...
متن کاملLPForget: A System of Forgetting in Answer Set Programming
A novel declarative approach of forgetting in answer set programming (ASP) has been proposed recently. In this paper we report a system prototype of forgetting in ASP, called LPForget. It consists of two modules: (1) Forgetting: computing the result of forgetting about certain literals in logic program under the answer set semantics; (2) CRS: application of forgetting in resolving conflict (or ...
متن کاملForgetting for Answer Set Programs Revisited
A new semantic forgetting for answer set programs (ASP), called SM-forgetting, is proposed in the paper. It distinguishes itself from the others in that it preserves not only skeptical and credulous consequences on unforgotten variables, but also strong equivalence – forgetting same variables in strongly equivalent logic programs has strongly equivalent results. The forgetting presents a positi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2021
ISSN: ['1471-0684', '1475-3081']
DOI: https://doi.org/10.1017/s1471068421000570